Fifteen consecutive integers with exactly four prime factors
نویسندگان
چکیده
منابع مشابه
Fifteen consecutive integers with exactly four prime factors
We describe a successful search for a sequence of fifteen consecutive integers, each the product of exactly four prime factors. Fifteen is best possible.
متن کاملPrime factors of consecutive integers
This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in the sequence of integers at least one of whose prime factors exceeds k. This algorithm enables us to show that f(k) is not monotone, verifying a conjecture of Ecklund and Eggleton.
متن کاملOn Strings of Consecutive Integers with No Large Prime Factors
We investigate conditions which ensure that systems of binomial polynomials with integer coefficients are simultaneously free of large prime factors. In particular, for each positive number ", we show that there are infinitely many strings of consecutive integers of size about n, free of prime factors exceeding n, with the length of the strings tending to infinity with speed log log log log n. ...
متن کاملSome Problems on the Prime Factors of Consecutive Integers
One would expect that v o(n) > oo as n -> oo but we are very far from being able to prove this . We can only show that vo(n) > 1 for n > 17 . In fact we can show the following result : vo(n) > 1 for all n except n = 1, 2, 3, 4, 7, 8, 16 . It is easy to see that vo(n) = 1 for the above values of n . In general if k > 1 then v(n ; k) < 1 for Ice + 3k > n 3 . In fact for k > n we have v(n ; k) = 1...
متن کاملON THE PRIME FACTORS OF \k/ AND OF CONSECUTIVE INTEGERS
1. First we introduce some notations. elements of the finite set S is denoted by ISI. We write ex = exp x. We denote the i th prime number by p i ,. v(n) denotes the number of distinct prime factors of n. mk is the smallest integer m for which v(1k» > k. P(n) is the greatest, p(n) the smallest prime factor of n. nk is the smallest integer n for which P(n+i) > k for all 1 < i <_ k. Mk > c I k 2 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2001
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-01-01321-7